ASP modulo CSP: The clingcon system
نویسنده
چکیده
We present the hybrid ASP solver clingcon, combining the simple modeling language and the high performance Boolean solving capacities of Answer Set Programming (ASP) with techniques for using non-Boolean constraints from the area of Constraint Programming (CP). The new clingcon system features an extended syntax supporting global constraints and optimize statements for constraint variables. The major technical innovation improves the interaction between ASP and CP solver through elaborated learning techniques based on socalled irreducible inconsistent sets. An empirical evaluation on a broad class of benchmarks shows that these techniques yield a performance improvement of an order of magnitude.
منابع مشابه
Clingcon: The next generation
We present the third generation of the constraint answer set system clingcon, combining Answer Set Programming (ASP) with finite domain constraint processing (CP). While its predecessors rely on a black-box approach to hybrid solving by integrating the CP solver gecode, the new clingcon system pursues a lazy approach using dedicated constraint propagators to extend propagation in the underlying...
متن کاملWeighted-Sequence Problem: ASP vs CASP and Declarative vs Problem-Oriented Solving
We define the weighted-sequence problem inspired by an important industrial problem in oracle query optimization. We evaluate several approaches to solving this problem using answer set programming (ASP) system clingo and constraint answer set programming (CASP) solver clingcon. The focus of this paper is an experimental evaluation of search procedures behind clingo and clingcon. We used instan...
متن کاملOn the Relation of Constraint Answer Set Programming Languages and Algorithms
Recently a logic programming language AC was proposed by Mellarkod et al. (2008) to integrate answer set programming (ASP) and constraint logic programming. Similarly, Gebser et al. (2009) proposed a CLINGCON language integrating ASP and finite domain constraints. These languages allow new efficient inference algorithms that combine traditional ASP procedures and other methods in constraint pro...
متن کاملAnswer-Set Programming in Requirements Engineering
[Context and motivation] Requirements form the foundation of software systems. The quality of the requirements influences the quality of the developed software. [Question/problem] One of the main requirement issues is inconsistency, particularly onerous when the requirements concern temporal constraints. Manual checking whether temporal requirements are consistent is tedious and error prone and...
متن کاملA transition system for AC language algorithms
Recently a logic programming language AC was proposed by Mellarkod et al. (2008) to integrate answer set programming (ASP) and constraint logic programming. In a similar vein, Gebser et al. (2009) proposed a clingcon language integrating ASP and finite domain constraints. A distinguishing feature of these languages is their capacity to allow new efficient inference algorithms that combine tradi...
متن کامل